DL-SR: a Lite DL with Expressive Rules: Preliminary Results
نویسندگان
چکیده
Simple conceptual graphs can be seen as a very basic description logic, allowing however for answering conjunctive queries. In the first part of this paper, we translate some results obtained for conceptual graph rules of form “if A then B” into an equivalent DL-based formalism. Then we show that, our algorithms can automatically decide in some cases whether a given DL has the FOL-reducibility property, provided that the semantics of its constructors can be expressed by rules.
منابع مشابه
Query Rewriting for Horn-SHIQ Plus Rules
Query answering over Description Logic (DL) ontologies has become a vibrant field of research. Efficient realizations often exploit database technology and rewrite a given query to an equivalent SQL or Datalog query over a database associated with the ontology. This approach has been intensively studied for conjunctive query answering in the DL-Lite and EL families, but is much less explored fo...
متن کاملQuery Answering in Expressive Variants of DL-Lite
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large amounts of data, is posing challenging requirements w.r.t. the trade-off between the expressive power of a Description Logic and the efficiency of reasoning. The logics of the DL-Lite family were specifically designed t...
متن کاملExpressive Querying over Fuzzy DL-Lite Ontologies
Fuzzy Description Logics (f-DLs) have been proposed as formalisms capable of capturing and reasoning about imprecise and vague knowledge. The last years, research in Description Logics, and also in fDLs, is largely focused on the development of languages where complexity of query answering is as efficient as query answering in data bases. One such example is the DL-Lite language and its fuzzy e...
متن کاملExtending the SHOIQ(D) Tableaux with DL-safe Rules: First Results
On the Semantic Web, there has been increasing demand for a ruleslike expressivity that goes beyond OWL-DL. Efforts of combining rules languages and description logics usually produce undecidable formalisms, unless constrained in a specific way. We look at one of the most expressive but decidable such formalisms proposed: DL-safe rules, and present a tableaux-based algorithm for query answering...
متن کاملReasoning with Temporal Properties over Axioms of DL-Lite
Recently, a lot of research has combined description logics (DLs) of the DL-Lite family with temporal formalisms. Such logics are proposed to be used for situation recognition and temporalized ontology-based data access. In this report, we consider DL-Lite-LTL, in which axioms formulated in a member of the DL-Lite family are combined using the operators of propositional linear-time temporal log...
متن کامل